Six Hypotheses in Search of a Theorem

نویسندگان

  • Harry Buhrman
  • Lance Fortnow
  • Leen Torenvliet
چکیده

z Sir, we are truly six special and interesting characters. Believe us. However we have gone lost. Abstract We consider the following six hypotheses: P = NP. SAT is truth-table reducible to a P-selective set. SAT is truth-table reducible to a k-approximable set for some k.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A unique common fixed point theorem for six maps in g-metric spaces

In this paper we obtain a unique common xed point theorem for sixweakly compatible mappings in G-metric spaces.

متن کامل

A COMMON FIXED POINT THEOREM FOR SIX WEAKLY COMPATIBLE MAPPINGS IN M-FUZZY METRIC SPACES

In this paper, we give some new definitions of M-fuzzy metric spaces and we prove a common fixed point theorem for six mappings under the condition of weakly compatible mappings in complete M-fuzzy metric spaces.

متن کامل

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

متن کامل

WORKSHOP: An Introduction to Automatic Theorem Proving in Geometry and Automatic Search of Geometric Loci with DERIVE 5

There are two methods of Automatic Theorem Proving in Geometry: the Gröbner bases method and Wu’s pseudo-remainder method. The idea in the behind both methods is this: some hypotheses and a thesis are given. Instead of working with a geometric drawing of the configuration and reasoning “mathematically”, the hypotheses and the thesis are, respectively, translated into a set of polynomials and (u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997